Hybrid evolutionary search for the minimum sum coloring problem of graphs
نویسندگان
چکیده
منابع مشابه
Hybrid evolutionary search for the minimum sum coloring problem of graphs
Given a graph G, a proper k-coloring of G is an assignment of k colors {1, . . . , k} to the vertices of G such that two adjacent vertices receive two different colors. The minimum sum coloring problem (MSCP) is to find a proper k-coloring while minimizing the sum of the colors assigned to the vertices. This paper presents a stochastic hybrid evolutionary search algorithm for computing upper an...
متن کاملMinimum Sum Coloring of P4-sparse graphs
In this paper, we study the Minimum Sum Coloring (MSC) problem on P4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum of the numbers assigned to the vertices is minimum. First, we introduce the concept of maximal sequence associated with an optimal solution of the MSC problem of any graph. N...
متن کاملGreedy Algorithms for the Minimum Sum Coloring Problem
In this paper we present our study of greedy algorithms for solving the minimum sum coloring problem (MSCP). We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the graph coloring problem (GCP): DSATUR [1] and RLF [2].
متن کاملA memetic algorithm for the Minimum Sum Coloring Problem
Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on...
متن کاملA Study of Breakout Local Search for the Minimum Sum Coloring Problem
Given an undirected graph G = (V,E), the minimum sum coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. In this paper, we present Breakout Local Search (BLS) for MSCP which combines some essential features of several well-established metaheuristics. BLS ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2016
ISSN: 0020-0255
DOI: 10.1016/j.ins.2016.02.051